Bounded-call broadcasting
نویسندگان
چکیده
منابع مشابه
Broadcasting in Bounded Degree Graphs
Broadcasting is an information dissemination process in which a message is to be sent from a single originator to all members of a network by placing calls over the communication lines of the network. Several previous papers have investigated methods to construct sparse graphs (networks) in which this process can be completed in minimum time from any originator. The graphs produced by these met...
متن کاملBroadcasting on Bounded Degree DAGs
We study the following generalization of the well-known model of broadcasting on trees. Consider an infinite directed acyclic graph (DAG) with a unique source node X . Let the collection of nodes at distance k from X be called the kth layer. At time zero, the source node is given a bit. At time k ≥ 1, each node in the (k − 1)th layer inspects its inputs and sends a bit to its descendants in the...
متن کاملBroadcasting with linearly bounded transmission faults
We consider broadcasting with a linearly bounded number of transmission failures. For a constant parameter 0 < < 1 we assume that at most i faulty transmissions can occur during the rst i time units of the communication process, for every natural number i. Every informed node can transmit information to at most one neighbor in a unit of time. Faulty transmissions have no eeect. We investigate w...
متن کاملEfficient broadcasting with linearly bounded faults I*,
We consider the problem of broadcasting in the presence of linearly bounded number of transient faults. For some fixed 0 <IX < 1 we assume that at most zi faulty transmissions can occur during the first i time units of the broadcasting algorithm execution, for every natural i. In a unit of time every node can communicate with at most one neighbor. We prove that some bounded degree networks are ...
متن کاملThe complexity of broadcasting in bounded-degree networks
Because of cost and physical limitations there is an interest in broadcast networks with a fixed maximum number of communication links for each node, [BHLP,LP,DFF]. In this note we show that given an arbitrary bounded-degree network, determining the minimum broadcast time for any originating node is NPcomplete. For the NP-completeness proof of the general case of unbounded-degree networks, it i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1994
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90178-3